Guessing subject to distortion
نویسندگان
چکیده
منابع مشابه
Guessing Subject to Distortion
We investigate the problem of guessing a random vector X within distortion level D. Our aim is to characterize the best attainable performance in the sense of minimizing, in some probabilistic sense, the number of required guesses G(X) until the error falls below D. The underlying motivation is that G(X) is the number of candidate codewords to be examined by a rate-distortion block encoder unti...
متن کاملGuessing and compression subject to distortion
The problem of guessing a random string is revisited. The relationship between guessing without distortion and compression is extended to the case when source alphabet size is countably infinite. Further, similar relationship is established for the case when distortion allowed by establishing a tight relationship between rate distortion codes and guessing strategies.
متن کاملOn the Shannon Cipher System With a Wiretapper Guessing Subject to Distortion and Reliability Requirements
In this paper we discuss the processes in the Shannon cipher system with discrete memoryless source and a guessing wiretapper. The wiretapper observes a cryptogram of N vector of ciphered messages in the public channel and tries to guess successively the vector of messages within given distortion level ∆ and small probability of error less than exp{−NE} with positive reliability index E. The se...
متن کاملAnalysing Protocol Subject to Guessing Attacks
In this paper we consider guessing attacks upon security protocols, where an intruder guesses one of the values used (typically a poorly-chosen password) and then seeks to verify that guess. We formalise such attacks, and in particular the way in which the guess is verified. We then describe how to model such attacks within the process algebra CSP, so that they can be detected using the model c...
متن کاملAnalysing protocols subject to guessing attacks
In this paper we consider guessing attacks upon security protocols, where an intruder guesses one of the values used (typically a poorlychosen password) and then seeks to verify that guess. We formalise such attacks, and in particular the way in which the guess is verified. We then describe how to model such attacks within the process algebra CSP, so that they can be detected using the model ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1998
ISSN: 0018-9448
DOI: 10.1109/18.669158